منابع مشابه
Stabilized column generation
MDVSP k k p p k k p K k p k p k ip K k p k p k p k k k ip k k p k j ij i i ij i i p K k x K k n x N i x a x c K k n N i p a p c K k K N j i t d s t A j i A K N j i j i d N i s N i t N K k k k min depot at vehicles of number available : otherwise 0 ; task covers path if 1 path of cost : depot to and from paths of set : , for , if) , (arcs; of set : , for , node to node from go to time : for task...
متن کاملDual Inequalities for Stabilized Column Generation Revisited
Column generation (CG) models have several advantages over compact formulations, namely, they provide better LP bounds, may eliminate symmetry, and can hide non-linearities in their subproblems. However, users also encounter drawbacks in the form of slow convergency a.k.a. the tailing-off effect and the oscillation of the dual variables. Among different alternatives for stabilizing the CG proce...
متن کاملColumn Generation
Column generation is an indispensable tool in computational optimization to solve a mathematical program by iteratively adding the variables of the model. Even though the method is simple in theory there are many algorithmic choices and we discuss the most common ones. Particular emphasis in put on the dual interpretation, relating column generation to Langrangian relaxation and cutting plane a...
متن کاملA Time-Indexed Generalized Vehicle Routing Model and Stabilized Column Generation for Military Aircraft Mission Planning
We introduce a time-indexed mixed-integer linear programming model for a military aircraft mission planning problem, where a fleet of cooperating aircraft should attack a number of ground targets so that the total expected effect is maximized. The model is a rich vehicle routing problem and the direct application of a general solver is practical only for scenarios of very moderate sizes. We pro...
متن کاملStabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem
We consider the rooted delay-constrained Steiner tree problem which arises for example in the design of centralized multicasting networks where quality of service constraints are of concern. We present a path based integer linear programming formulation which has already been considered in the literature for the spanning tree variant. Solving its linear relaxation by column generation has so fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00213-1